Soundness, idempotence and commutativity of set-sharing
نویسندگان
چکیده
منابع مشابه
Soundness, idempotence and commutativity of set-sharing
It is important that practical data-flow analyzers are backed by reliably proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic properties for an abstract domain to be well-defined and sound with respect to the concrete semantics. In logic programming, the abstract domain Sharing is a standard choice for sharing analysis for both pract...
متن کاملSoundness of Inprocessing in Clause Sharing SAT Solvers
We present a formalism that models the computation of clause sharing portfolio solvers with inprocessing. The soundness of these solvers is not a straightforward property since shared clauses can make a formula unsatisfiable. Therefore, we develop characterizations of simplification techniques and suggest various settings how clause sharing and inprocessing can be combined. Our formalization mo...
متن کاملQuantum Algorithm for Commutativity Testing of a Matrix Set
Suppose we have k matrices of size n × n. We are given an oracle that knows all the entries of k matrices, that is, we can query the oracle an (i, j) entry of the l-th matrix. The goal is to test if each pair of k matrices commute with each other or not with as few queries to the oracle as possible. In order to solve this problem, we use a theorem of Mario Szegedy [Sze04b, Sze04a] that relates ...
متن کاملSCT and the idempotence condition Draft
These notes show how to get rid of the idempotence condition (G = G;G) in (δ)-Size Change Termination. Both the “graph algorithm” of the original SCT paper [LJBA01] and the δSCT criterion of BenAmram [BA06] use some kind of idempotence on the potential cycles. This idempotence condition can be replaced by a more semantical condition on the cycles. The new condition is probably not easier to com...
متن کاملSet-Sharing is Redundant for Pair-Sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In this paper, we question, apparently for the first time, whether this domain is over-complex for pair-sharing analysis. We show that the answer is yes. By defining an equivalence relation over the set-sharing domain we ob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2002
ISSN: 1471-0684
DOI: 10.1017/s1471068401001338